Math 249: Algebraic Combinatorics

نویسندگان

  • Evan Chen
  • Lauren K Williams
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Covering the Large Spectrum and Generalized Riesz Products

Chang’s Lemma is a widely employed result in additive combinatorics. It gives optimal bounds on the dimension of the large spectrum of probability distributions on nite abelian groups. In this note, we show how Chang’s Lemma and a powerful variant due to Bloom both follow easily from an approximation theorem for probability measures in terms of generalized Riesz products. The latter result invo...

متن کامل

The structure of strong tournaments containing exactly one out-arc pancyclic vertex

An arc in a tournament T with n ≥ 3 vertices is called pancyclic if it belongs to a cycle of length l for all 3 ≤ l ≤ n. We call a vertex u of T an out-arc pancyclic vertex of T if each out-arc of u is pancyclic in T . Yao, Guo and Zhang [Discrete Appl. Math. 99 (2000), 245–249] proved that every strong tournament contains at least one out-arc pancyclic vertex, and they gave an infinite class o...

متن کامل

Pancyclic out-arcs of a vertex in a hypertournament

A k-hypertournament H on n vertices, where 2 ≤ k ≤ n, is a pair H = (V,AH), where V is the vertex set of H and AH is a set of k-tuples of vertices, called arcs, such that for all subsets S ⊆ V of order k, AH contains exactly one permutation of S as an arc. Inspired by the successful extension of classical results for tournaments (i.e. 2-hypertournaments) to hypertournaments, by Gutin and Yeo [J...

متن کامل

Math 249 A Fall 2010 : Transcendental Number Theory

α is algebraic if there exists p ∈ Z[x], p 6= 0 with p(α) = 0, otherwise α is called transcendental . Cantor: Algebraic numbers are countable, so transcendental numbers exist, and are a measure 1 set in [0, 1], but it is hard to prove transcendence for any particular number. Examples of (proported) transcendental numbers: e, π, γ, e, √ 2 √ 2 , ζ(3), ζ(5) . . . Know: e, π, e, √ 2 √ 2 are transce...

متن کامل

Orthogonal 3-GDDs with four groups

Consider a pair of group divisible designs (GDD) with block size 3, index λ = 1, and on the same points and groups. They are said to be orthogonal (OGDD) if (i) whenever two blocks, one from each design, intersect in two points, the third points are in different groups; and (ii) two disjoint pairs of points defining intersecting triples in one GDD fail to do so in the other. A question posed by...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013